1767A - Cut the Triangle - CodeForces Solution


implementation *800

Please click on ads to support us..

Python Code:

for _ in range(int(input())):
    MooRsy = input()
    v = []
    u = []
    for _ in range(3):
        a ,b = [int(i) for i in input().split()]
        if a not in v:
            v.append(a)
        if b not in u:
            u.append(b)
    if len(v) == 3 or len(u) == 3:
        print("Yes")
    else:
        print("No")

C++ Code:

#include <bits/stdc++.h>
using    namespace std;
#define  ll  long long 
#define  ulli unsigned ll
#define  ld   long double
#define  pb   push_back
#define  vi   vector<int>
#define  vl   vector<ll>
#define  vc   vector<char>
#define  all(v) v.begin(),v.end()
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ls first
#define rs second
#define FAST ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
const ll M=(ll)(pow(10,9)+7);
int x[4],y[4];
void solve()
{
    FAST;
    for(int i=0;i<3;i++)
    {
        cin>>x[i];
        cin>>y[i];
    }
    if ((x[0]==x[1]||x[1]==x[2]||x[2]==x[0])&&(y[0]==y[1]||y[1]==y[2]|y[2]==y[0])) cout<<"NO\n";
    else cout<<"YES\n";
}
int main()
{
    FAST;
    int t;
    cin>>t;
    while(t--)
    {
        solve();
    }
}


Comments

Submit
0 Comments
More Questions

383. Ransom Note
242. Valid Anagram
141. Linked List Cycle
21. Merge Two Sorted Lists
203. Remove Linked List Elements
733. Flood Fill
206. Reverse Linked List
83. Remove Duplicates from Sorted List
116. Populating Next Right Pointers in Each Node
145. Binary Tree Postorder Traversal
94. Binary Tree Inorder Traversal
101. Symmetric Tree
77. Combinations
46. Permutations
226. Invert Binary Tree
112. Path Sum
1556A - A Variety of Operations
136. Single Number
169. Majority Element
119. Pascal's Triangle II
409. Longest Palindrome
1574A - Regular Bracket Sequences
1574B - Combinatorics Homework
1567A - Domino Disaster
1593A - Elections
1607A - Linear Keyboard
EQUALCOIN Equal Coins
XOREQN Xor Equation
MAKEPAL Weird Palindrome Making
HILLSEQ Hill Sequence